Rule Pruning in Associative Classification Mining

نویسنده

  • Fadi Thabtah
چکیده

Classification and association rule discovery are important data mining tasks. Using association rule discovery to construct classification systems, also known as associative classification, is a promising approach. In this paper, we survey different rule pruning methods used by associative classification techniques. Furthermore, we compare the effect of three pruning methods (database coverage, pessimistic error estimation, lazy pruning) on the number of rules derived from different classification data sets. Results obtained from experimenting on fourteen data sets from the UCI data collection show the need for additional constraints during pruning in associative classification in order to decrease further the size of the resulting classifiers. The results also indicate that lazy pruning algorithms generate very large number of rules if compared with other associative algorithms. This may reduce their use for data mining applications where a concise set of rules is required.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Review and Comparison of Associative Classification Data Mining Approaches

Associative classification (AC) is a data mining approach that combines association rule and classification to build classification models (classifiers). AC has attracted a significant attention from several researchers mainly because it derives accurate classifiers that contain simple yet effective rules. In the last decade, a number of associative classification algorithms have been proposed ...

متن کامل

Review and Comparison of Associative Classification Data Mining Approaches

Associative classification (AC) is a data mining approach that combines association rule and classification to build classification models (classifiers). AC has attracted a significant attention from several researchers mainly because it derives accurate classifiers that contain simple yet effective rules. In the last decade, a number of associative classification algorithms have been proposed ...

متن کامل

Pruning Techniques in Associative Classification: Survey and Comparison

Association rule discovery and classification are common data mining tasks. Integrating association rule and classification also known as associative classification is a promising approach that derives classifiers highly competitive with regards to accuracy to that of traditional classification approaches such as rule induction and decision trees. However, the size of the classifiers generated ...

متن کامل

A review of associative classification mining

Associative classification mining is a promising approach in data mining that utilizes the association rule discovery techniques to construct classification systems, also known as associative classifiers. In the last few years, a number of associative classification algorithms have been proposed, i.e. CPAR, CMAR, MCAR, MMAC and others. These algorithms employ several different rule discovery, r...

متن کامل

A Study of Predictive Accuracy for Four Associative Classifiers

Association rule discovery is one of the primary tasks in data mining that extracts patterns to describe correlations between items in a transactional database. Using association rule mining for constructing classification systems is a promising approach. There are many associative classification approaches that have been proposed recently such as CBA, CMAR and MCAR. In this research paper, fou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005